Simple planar graph partition into three forests
نویسندگان
چکیده
منابع مشابه
Simple Planar Graph Partition into Three Forests
We describe a simple way of partitioning a planar graph into three edge-disjoint forests in O(n log n) time, where n is the number of its vertices. We can use this partition in Kannan et al.‘s graph representation (1992) to label the planar graph vertices so that any two vertices’ adjacency can be tested locally by comparing their names in constant time.
متن کاملSimple Algorithms for Graph Partition Problems
Based on the Belief Propagation Method, we propose simple and deterministic algorithms for some NP-hard graph partitioning problems, such as the Most Likely Partition problem and the Graph Bisection problem. These algorithms run in O(n+m) or O((n+m) log n) time on graphs with n vertices and m edges. For their average case analysis, we consider the planted solution model and prove that they yiel...
متن کاملGraph partition into paths containing specified vertices
For a graph G, let 2(G) denote the minimum degree sum of a pair of nonadjacent vertices. Suppose G is a graph of order n. Enomoto and Ota (J. Graph Theory 34 (2000) 163–169) conjectured that, if a partition n = ∑k i=1 ai is given and 2(G)¿ n + k − 1, then for any k distinct vertices v1; : : : ; vk , G can be decomposed into vertex-disjoint paths P1; : : : ; Pk such that |V (Pi)| = ai and vi is ...
متن کاملEdge Partition of Toroidal Graphs into Forests in Linear Time
In this paper we give a linear algorithm to edge partition a toroidal graph, i.e., graph that can be embedded on the orientable surface of genus one without edge crossing, into three forests plus a set of at most three edges. For triangulated toroidal graphs, this algorithm gives a linear algorithm for finding three edge-disjoint spanning trees. This is in a certain way an extension of the well...
متن کاملInserting Multiple Edges into a Planar Graph
Let G be a connected planar (but not yet embedded) graph and F a set of additional edges not in G. The multiple edge insertion problem (MEI) asks for a drawing of G+F with the minimum number of pairwise edge crossings, such that the subdrawing of G is plane. An optimal solution to this problem is known to approximate the crossing number of the graph G+ F . Finding an exact solution to MEI is NP...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(98)00007-9